Heuristic Algorithms for Solving Multiobjective Transportation Problems
نویسندگان
چکیده
منابع مشابه
Heuristic Multiobjective Search for Hazmat Transportation Problems
This paper describes the application of multiobjective heuristic search algorithms to the problem of hazardous material (hazmat) transportation. The selection of optimal routes inherently involves the consideration of multiple conflicting objectives. These include the minimization of risk (e.g. the exposure of the population to hazardous substances in case of accident), transportation cost, tim...
متن کاملA Simple Heuristic for Solving Generalized Fuzzy Transportation Problems
In this paper, a new method is proposed for solving a special type of fuzzy transportation problem by assuming that a decision maker is uncertain about the precise values of transportation cost only but there is no uncertainty about the supply and demand of the product. In the proposed method transportation costs are represented by generalized trapezoidal fuzzy numbers. To illustrate the propos...
متن کاملNew Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...
متن کاملnew heuristic algorithms for solving single-vehicle and multi-vehicle generalized traveling salesman problems (gtsp)
among numerous np-hard problems, the traveling salesman problem (tsp) has been one of the most explored, yet unknown one. even a minor modification changes the problem’s status, calling for a different solution. the generalized traveling salesman problem (gtsp)expands the tsp to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...
متن کاملSolving multiobjective linear programming problems using ball center of polytopes
Here, we aim to develop a new algorithm for solving a multiobjective linear programming problem. The algorithm is to obtain a solution which approximately meets the decision maker's preferences. It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution. Numerical examples and a simulation study are used to illu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics Research
سال: 2016
ISSN: 1916-9809,1916-9795
DOI: 10.5539/jmr.v8n3p1